Open and Closed Prefixes of Sturmian Words
نویسندگان
چکیده
A word is closed if it contains a proper factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We deal with the sequence of open and closed prefixes of Sturmian words and prove that this sequence characterizes every finite or infinite Sturmian word up to isomorphisms of the alphabet. We then characterize the combinatorial structure of the sequence of open and closed prefixes of standard Sturmian words. We prove that every standard Sturmian word, after swapping its first letter, can be written as an infinite product of squares of reversed standard words.
منابع مشابه
Enumeration and structure of trapezoidal words
Trapezoidal words are words having at most n+1 distinct factors of length n for every n ≥ 0. They therefore encompass finite Sturmian words. We give combinatorial characterizations of trapezoidal words and exhibit a formula for their enumeration. We then separate trapezoidal words into two disjoint classes: open and closed. A trapezoidal word is closed if it has a factor that occurs only as a p...
متن کاملThe sequence of open and closed prefixes of a Sturmian word
A finite word is closed if it contains a factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We are interested in the ocsequence of a word, which is the binary sequence whose n-th element is 0 if the prefix of length n of the word is open, or 1 if it is closed. We exhibit results showing that this sequence is deeply related to the co...
متن کاملEnumerating Abelian Returns to Prefixes of Sturmian Words
We follow the works of Puzynina and Zamboni, and Rigo et al. on abelian returns in Sturmian words. We determine the cardinality of the set APRu of abelian returns of all prefixes of a Sturmian word u in terms of the coefficients of the continued fraction of the slope, dependingly on the intercept. We provide a simple algorithm for finding the set APRu and we determine it for the characteristic ...
متن کاملA Classification of Trapezoidal Words
Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n≥ 0. They encompass finite Sturmian words. We distinguish trapezoidal words into two disjoint subsets: open and closed trapezoidal words. A trapezoidal word is closed if its longest repeated prefix has exactly two occurrences in the word, the second one being a suffix of the word. Otherwise it is open...
متن کامل